Gradual Abstract Proof Search
نویسنده
چکیده
Gradual Abstract Proof Search (GAPS) is a new 2-player search technique. It has been used to prove that 11x11 Phutball is a win for the first player in 25 plies or less, that 6x6 Atari-Go with a crosscut in the center is a win for the first player in 15 plies or less. I give domain dependent optimizations for the two games. I also describe theoretical and experimental comparisons with other related algorithms.
منابع مشابه
Admissible Moves in Two-Player Games
Some games have abstract properties that can be used to design admissible heuristics on moves. These admissible heuristics are useful to speed up search. They work well with depth-bounded search algorithms such as Gradual Abstract Proof Search that select moves based on the distance to the goal. We analyze the benefits of these admissible heuristics on moves for rules generation and search. We ...
متن کاملMemoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the operational semantics of logic programming. In this paper, we discuss experiments with a prototype for memoization-based proof search for Elf programs. We compare the performance of memoization-based proof search, dep...
متن کاملAbstract Interpretation of Linear Logic Programming
Linear Logic is gaining momentum in computer science because it ooers a uniied framework and a common vocabulary for studying and analyzing diierent aspects of programming and computation. We focus here on models where computation is identiied with proof search in the sequent system of Linear Logic. A proof normalization procedure, called \focusing", has been proposed to make the problem of pro...
متن کامل2 a Theory of Abstraction Using Abstraction
Korf Korf, 1979] provides a similar computational analysis of the beneets of abstraction for state space search. This analysis is essentially restricted to Abstrips abstractions as it ignores the cost of building abstract proof plans. Like us, Korf assumes no mapping failures, and a constant branching rate. Finally, in Giunchiglia & Walsh, 1989b] we analysed the theoretical and empirical proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ICGA Journal
دوره 25 شماره
صفحات -
تاریخ انتشار 2002